Fundamental trade-offs in aggregate packet scheduling
نویسندگان
چکیده
منابع مشابه
Emulating Batteries with Deferrable Energy Demand: Fundamental Trade-offs and Scheduling Policies
We investigate the ability of a homogeneous collection of deferrable energy loads to behave as a battery; that is, to absorb and release energy in a controllable fashion up to fixed and predetermined limits on volume, charge rate and discharge rate. We derive explicit bounds on the battery capacity that can be offered, and show that there is a fundamental trade-off between the abilities of coll...
متن کاملFundamental Resource Trade-offs for Encoded Distributed Optimization
Dealing with the shear size and complexity of today’s massive data sets requires computational platforms that can analyze data in a parallelized and distributed fashion. A major bottleneck that arises in such modern distributed computing environments is that some of the worker nodes may run slow. These nodes a.k.a. stragglers can significantly slow down computation as the slowest node may dicta...
متن کاملFundamental trade-offs generating the worldwide leaf economics spectrum.
Recent work has identified a worldwide "economic" spectrum of correlated leaf traits that affects global patterns of nutrient cycling and primary productivity and that is used to calibrate vegetation-climate models. The correlation patterns are displayed by species from the arctic to the tropics and are largely independent of growth form or phylogeny. This generality suggests that unidentified ...
متن کاملCloud and Cache-Aided Wireless Networks: Fundamental Latency Trade-Offs
A cloud and cache-aided wireless network architecture is studied in which edge-nodes (ENs), such as base stations, are connected to a cloud processor via dedicated fronthaul links, while also being endowed with caches. Cloud processing enables the centralized implementation of cooperative transmission strategies at the ENs, albeit at the cost of an increased latency due to fronthaul transfer. I...
متن کاملTime-Related Trade-Offs in Dynamic Function Scheduling
A possible route to managing workload peaks facilitated by advances in technology is to use Dynamic Function Allocation, in other words to design work so that it is possible to switch adaptively between levels of automation. In the main, current approaches to Dynamic Function Allocation assume that functions are to be serviced as soon as possible, and in order of arrival. These methods utilise ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: IEEE Transactions on Parallel and Distributed Systems
سال: 2005
ISSN: 1045-9219
DOI: 10.1109/tpds.2005.149